-
1 behavior of automaton
Большой англо-русский и русско-английский словарь > behavior of automaton
-
2 behavior of automaton
Математика: поведение автомата -
3 поведение автомата
Большой англо-русский и русско-английский словарь > поведение автомата
-
4 probabilistic
English-Russian dictionary on nuclear energy > probabilistic
См. также в других словарях:
Cellular automaton — A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, theoretical biology and microstructure modeling. It consists of a regular grid of cells , each in one of a finite number of states … Wikipedia
Cyclic cellular automaton — A one dimensional cyclic cellular automaton with n = 4, run for 300 steps from a random initial configuration. The cyclic cellular automaton is a cellular automaton rule developed by David Griffeath and studied by several other cellular automaton … Wikipedia
Movable cellular automaton — method Movable cellular automaton actively changed self neighbors by means switching neighbors state from linked to unlinked and vice versa (modeling of contact interaction) Method type Continuous/Discrete Discrete … Wikipedia
Life-like cellular automaton — A cellular automaton (CA) is Life like (in the sense of being similar to Conway s Game of Life) if it meets the following criteria: The array of cells of the automaton has two dimensions. Each cell of the automaton has two states (conventionally… … Wikipedia
ω-automaton — In automata theory, a branch of theoretical computer science, an ω automaton (or stream automaton) is a deterministic or nondeterministic automaton that runs on infinite, rather than finite, strings as input. Since ω automata do not stop, they… … Wikipedia
Block cellular automaton — The Margolus neighborhood for a two dimensional block cellular automaton. The partition of the cells alternates between the set of 2 × 2 blocks indicated by the solid blue lines, and the set of blocks indicated by the dashed red lines. A block… … Wikipedia
Büchi automaton — A Büchi automaton is the extension of a finite state automaton to infinite inputs. It accepts an infinite input sequence iff there exists a run of the automaton (in case of a deterministic automaton, there is exactly one possible run) which… … Wikipedia
Codd's cellular automaton — A simple configuration in Codd s cellular automaton. Signals pass along wire made of cells in state 1 (blue) sheathed by cells in state 2 (red). Two signal trains circulate around a loop and are duplicated at a T junction onto an open ended… … Wikipedia
Quantum dot cellular automaton — Quantum Dot Cellular Automata (sometimes referred to simply as quantum cellular automata, or QCA) Any device designed to represent data and perform computation, regardless of the physics principles it exploits and materials used to build it, must … Wikipedia
Alternating finite automaton — In automata theory, an alternating finite automaton (AFA) is a nondeterministic finite automaton whose transitions are divided into existential and universal transitions. For example, let A be an alternating automaton.* For an existential… … Wikipedia
Hybrid automaton — A hybrid automaton (plural hybrid automata) is a mathematical model for precisely describing systems where computational processes interact with physical processes. Its behavior consists of discrete state transitions and continuous… … Wikipedia